Fast transforms: Banded matrices with banded inverses.
نویسنده
چکیده
It is unusual for both A and A(-1) to be banded--but this can be a valuable property in applications. Block-diagonal matrices F are the simplest examples; wavelet transforms are more subtle. We show that every example can be factored into A = F(1)...F(N) where N is controlled by the bandwidths of A and A(-1) (but not by their size, so this extends to infinite matrices and leads to new matrix groups).
منابع مشابه
Block Matrices With -Block-banded Inverse: Inversion Algorithms
Block-banded matrices generalize banded matrices. We study the properties of positive definite full matrices whose inverses are -block-banded. We show that, for such matrices, the blocks in the -block band of completely determine ; namely, all blocks of outside its -block band are computed from the blocks in the -block band of . We derive fast inversion algorithms for and its inverse that, when...
متن کاملGroups of banded matrices with banded inverses
AproductADF1 : : : FN of invertible block-diagonalmatrices will be bandedwith a banded inverse. We establish this factorization with the numberN controlled by the bandwidthsw and not by the matrix size n:When A is an orthogonal matrix, or a permutation, or banded plus finite rank, the factors Fi have w D 1 and generate that corresponding group. In the case of infinite matrices, conjectures rema...
متن کاملBanded Matrices with Banded Inverses and A = LPU
Abstract. If A is a banded matrix with a banded inverse, then A = BC = F1 . . . FN is a product of block-diagonal matrices. We review this factorization, in which the Fi are tridiagonal and N is independent of the matrix size. For a permutation with bandwidth w, each Fi exchanges disjoint pairs of neighbors and N < 2w. This paper begins the extension to infinite matrices. For doubly infinite pe...
متن کاملFast Stable Solvers for Sequentially Semi-separable Linear Systems of Equations
We define the class of sequentially semi-separable matrices in this paper. Essentially this is the class of matrices which have low numerical rank on their off diagonal blocks. Examples include banded matrices, semi-separable matrices, their sums as well as inverses of these sums. Fast and stable algorithms for solving linear systems of equations involving such matrices and computing Moore-Penr...
متن کاملMatrices with banded inverses: Inversion algorithms and factorization of Gauss-Markov processes
The paper considers the inversion of full matrices whose inverses are -banded. We derive a nested inversion algorithm for such matrices. Applied to a tridiagonal matrix, the algorithm provides its explicit inverse as an element-wise product (Hadamard product) of three matrices. When related to Gauss–Markov random processes (GMrp), this result provides a closed-form factored expression for the c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Proceedings of the National Academy of Sciences of the United States of America
دوره 107 28 شماره
صفحات -
تاریخ انتشار 2010